Iterative blind deconvolution algorithm applied to phase retrieval

نویسنده

  • J. H. Seldin
چکیده

The iterative blind deconvolution algorithm proposed by Ayers and Dainty [Opt. Lett. 13,547 (1988)] and improved on by Davey et al. [Opt. Commun. 69,353 (1989)] is applied to the problem of phase retrieval, which is a special case of the blind deconvolution problem. A close relationship between this algorithm and the error-reduction version of the iterative Fourier-transform phase-retrieval algorithm is shown analytically. The performance of the blind deconvolution algorithm is compared with the error-reduction and hybrid input-output versions of the iterative Fourier-transform algorithm by reconstruction experiments on real-valued, nonnegative images with and without noise.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Low-rank spectral optimization

Various applications in signal processing and machine learning give rise to highly structured spectral optimization problems characterized by low-rank solutions. Two important examples that motivate this work are optimization problems from phase retrieval and from blind deconvolution, which are designed to yield rank-1 solutions. An algorithm is described based on solving a certain constrained ...

متن کامل

Speckle Deconvolution Imaging Using An Iterative Algorithm

We present an application of an iterative deconvolution algorithm to speckle interferometric data. This blind deconvolution algorithm permits the recovery of the target distribution when the point spread function is either unknown or poorly known. The algorithm is applied to specklegrams of the multiple star systems, and the results for UMa are compared to shift-and-add results for the same dat...

متن کامل

Implicit Regularization in Nonconvex Statistical Estimation: Gradient Descent Converges Linearly for Phase Retrieval, Matrix Completion and Blind Deconvolution

Recent years have seen a flurry of activities in designing provably efficient nonconvex procedures for solving statistical estimation problems. Due to the highly nonconvex nature of the empirical loss, stateof-the-art procedures often require proper regularization (e.g. trimming, regularized cost, projection) in order to guarantee fast convergence. For vanilla procedures such as gradient descen...

متن کامل

Phase retrieval for the Hubble Space Telescope using iterative propagation algorithms

Phase retrieval algorithms, including the iterative transform algorithm and gradient search algorithms, were generalized to include the effects of propagation through a complicated optical system and to discount the effects of bad CCD pixels. For the gradient search algorithms, analytic gradients were derived that greatly speed up the computation over finite difference methods. For the Hubble S...

متن کامل

Initialization of iterative parametric algorithms for blind deconvolution of motion-blurred images.

Performances of iterative blind deconvolution methods for motion-blurred images are usually reduced depending on the accuracy of the required initial guess of the blur. We examine this dependency, and a two-stage restoration procedure is proposed: First we perform a direct technique with a single straight-forward process to produce a rough initial estimate of the blur, and then an iterative tec...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002